The Cyclic Douglas–rachford Method for Inconsistent Feasibility Problems
نویسنده
چکیده
We analyse the behaviour of the newly introduced cyclic Douglas–Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty. 1. Preliminaries and Notation Throughout we assume H is a (real) Hilbert space with inner product 〈·, ·〉 and induced norm ‖ · ‖. We use → (resp. w. ⇀) to denote norm (resp. weak) convergence. We consider the convex feasibility problem
منابع مشابه
A Cyclic Douglas-Rachford Iteration Scheme
In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...
متن کاملDouglas–Rachford Feasibility Methods for Matrix Completion Problems
In this paper we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and non-convex real matrix-completion problems. These guidelines are demonstrated by various illustrative examples.
متن کاملTheory and Applications of Convex and Non-convex Feasibility Problems
Let X be a Hilbert space and let Cn, n = 1, . . . ,N be convex closed subsets of X . The convex feasibility problem is to find some point x ∈ N ⋂ n=1 Cn, when this intersection is non-empty. In this talk we discuss projection algorithms for finding such a feasibility point. These algorithms have wide ranging applications including: solutions to convex inequalities, minimization of convex nonsmo...
متن کاملOn Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
The Douglas–Rachford algorithm is a classical and very successful method for solving optimization and feasibility problems. In this paper, we provide novel conditions sufficient for finite convergence in the context of convex feasibility problems. Our analysis builds upon, and considerably extends, pioneering work by Spingarn. Specifically, we obtain finite convergence in the presence of Slater...
متن کاملA New Use of Douglas-Rachford Splitting and ADMM for Identifying Infeasible, Unbounded, and Pathological Conic Programs
In this paper, we present a method for identifying infeasible, unbounded, and pathological conic programs based on Douglas-Rachford splitting, or equivalently ADMM. When an optimization program is infeasible, unbounded, or pathological, the iterates of Douglas-Rachford splitting diverge. Somewhat surprisingly, such divergent iterates still provide useful information, which our method uses for i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013